Heuristics for Planning with SAT
نویسنده
چکیده
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performance by making the SAT solving process more application-specific. In this paper we propose a variable selection strategy for AI planning. The strategy is based on generic principles about properties of plans, and its performance with standard planning benchmarks often substantially improves on generic variable selection heuristics used in SAT solving, such as the VSIDS strategy. These improvements lift the efficiency of SAT based planning to the same level as best planners that use other search methods.
منابع مشابه
Heuristics for Planning with SAT and Expressive Action Definitions
We present the first effective SAT heuristics for planning with expressive planning languages such as ADL. Recently, SAT heuristics for STRIPS planning have been introduced. In this work we show that the basic ideas in the heuristic can be generalized to actions with conditional effects but without disjunction, and that disjunction requires a more fundamental analysis of the STRIPS heuristic, w...
متن کاملPlanning as satisfiability: Heuristics
Reduction to SAT is a very successful approach to solving hard combinatorial problems in Artificial Intelligence and computer science in general. Most commonly, problem instances reduced to SAT are solved with a general-purpose SAT solver. Although there is the obvious possibility of improving the SAT solving process with application-specific heuristics, this has rarely been done successfully. ...
متن کاملIncremental SAT Solving for SAT Based Planning
One of the most successful approaches to automated planning is the translation to propositional satis ability (SAT). This thesis evaluates incremental SAT solving for several modern encodings for SAT based planning. Experiments based on benchmarks from the 2014 International Planning Competition show that an incremental approach signi cantly outperforms non-incremental solving. Although, planni...
متن کاملHeuristics for HTN Planning as Satisfiability
Classical planning is the problem of synthesizing a sequence of actions to reach the goal state starting from the initial state. Hierarchical task networks (HTNs) have been used as a guidance for solving planning problems where tasks are decomposed into subtasks. Recently, both action-based planning as well as HTNbased planning have been east as SAT. The performance of planning as SAT has been ...
متن کاملSequential Monte Carlo in Probabilistic Planning Reachability Heuristics
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan lengths, they often do not scale for large problems or plan lengths. As has been shown in classical planning, heuristic search outperforms CSP/SAT techniques (especially when a plan length is not given a priori). The probl...
متن کامل